On the Number of Switches in Unbiased Coin-tossing
نویسنده
چکیده
A biased coin is tossed n times independently and sequentially. A “head” switch is a tail followed by a head and a “tail” switch is a head followed by a tail. Joint Laplace transform for the number of “head” switches and “tail” switches are given. For the total number of switches, the central limit theorem and the large deviation principle are established.
منابع مشابه
Can Optimally-Fair Coin Tossing Be Based on One-Way Functions?
Coin tossing is a basic cryptographic task that allows two distrustful parties to obtain an unbiased random bit in a way that neither party can bias the output by deviating from the protocol or halting the execution. Cleve [STOC’86] showed that in any r round coin tossing protocol one of the parties can bias the output by Ω(1/r) through a “fail-stop” attack; namely, they simply execute the prot...
متن کاملHonesty can be the best policy within quantum mechanics
Honesty has never been scientifically proved to be the best policy in any case. It is pointed out that only honest person can prevent his dishonest partner to bias the outcome of quantum coin tossing. Honesty is said to be the best policy. However, in many cases honest persons are the loser and dishonest persons are the winner. In support of the honest losers let us imagine a case where honest ...
متن کاملUNBIASED COIN TOSSING WITH A BIASED COIN by
PrQcedures are exhibited and analyzed for converting a sequence of iid Bernoulli variables with unknown mean p into a Bernoulli variable with mean 1/2. The efficiency of several procedures is studied.
متن کاملA Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness
It is well known that it is impossible for two parties to toss a coin fairly (Cleve, STOC 1986). This result implies that it is impossible to securely compute with fairness any function that can be used to toss a fair coin. In this paper, we focus on the class of deterministic Boolean functions with finite domain, and we ask for which functions in this class is it possible to information-theore...
متن کاملProtocols for Multiparty Coin Toss with Dishonest Majority
Coin-tossing protocols are protocols that generate a random bit with uniform distribution. These protocols are used as a building block in many cryptographic protocols. Cleve [STOC 1986] has shown that if at least half of the parties can be malicious, then, in any r-round coin-tossing protocol, the malicious parties can cause a bias of Ω(1/r) to the bit that the honest parties output. However, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013